Diagonalization and Unitary Equivalence Modulo Schatten p-Classes
نویسندگان
چکیده
منابع مشابه
Three observations regarding Schatten p classes ∗
The paper contains three results, the common feature of which is that they deal with the Schatten p class. The first is a presentation of a new complemented subspace of Cp in the reflexive range (and p ̸= 2). This construction answers a question of Arazy and Lindestrauss from 1975. The second result relates to tight embeddings of finite dimensional subspaces of Cp in C n p with small n and shows...
متن کاملPermutation Equivalence Classes of Kronecker Products of Unitary Fourier Matrices
Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many problems of mathematics and thoretical physics. The main result of the paper is splitting the set of all kronecker products of unitary Fourier matrices into pe...
متن کاملModulo Classes and Advice
We prove an upper bound on computing advice for a language A in the class of languages acceptable in deterministic polynomial time with logarithmic advice, A 2 P=log), relative to A itself. We then provide conditions under which advice for a language A 2 P=log can be computed in PF(A), and conditions for the existence of a set A in P=log without advice in PF(A). We show that paddable languages ...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملEquivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns
We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We apply these replacements in the classical sense; that is, the elements being replaced need not be adjacent in position or value. Given each replacement, the set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2000
ISSN: 0022-1236
DOI: 10.1006/jfan.2000.3614